S-hull: a fast radial sweep-hull routine for Delaunay triangulation
نویسنده
چکیده
A new O(nlog(n)) algorithm is presented for performing Delaunay triangulation of sets of 2D points. The novel component of the algorithm is a radially propagating sweep-hull (sequentially created from the radially sorted set of 2D points, giving a non-overlapping triangulation), paired with a final triangle flipping step to give the Delaunay triangluation. In empirical tests the algorithm runs in approximately half the time of q-hull for 2D Delaunay triangulation on randomly generated point sets.
منابع مشابه
A faster circle-sweep Delaunay triangulation algorithm
This paper presents a new way to compute the Delaunay triangulation of a planar set P of n points, using sweep-circle technique combined with the standard recursive edge-flipping. The algorithm sweeps the plane by an increasing circle whose center is a fixed point in the convex hull of P . Empirical results and comparisons show that it reduces the number of in-circle tests and edge-flips, and i...
متن کاملA 3D Sweep Hull Algorithm for computing Convex Hulls and Delaunay Triangulation
This paper presents a new O(nlog(n)) algorithm for computing the convex hull of a set of 3 dimensional points. The algorithm first sorts the point in (x,y,z) then incrementally adds sorted points to the convex hull using the constraint that each new point added to the hull can 'see' at least one facet touching the last point added. The reduces the search time for adding new points. The algorith...
متن کاملThe Convex Hull of Points on a Sphere is a Spanner
Let S be a finite set of points on the unit-sphere S. In 1987, Raghavan suggested that the convex hull of S is a Euclidean t-spanner, for some constant t. We prove that this is the case for t = 3π(π/2 + 1)/2. Our proof consists of generalizing the proof of Dobkin et al. [2] from the Euclidean Delaunay triangulation to the spherical Delaunay triangulation.
متن کاملVisualizing the Connection Among Convex Hull, Voronoi Diagram and Delaunay Triangulation
The convex hull, Voronoi diagram and Delaunay triangulation are all essential concepts in computational geometry. Algorithms for solving the convex hull problem are commonly taught in an algorithms course, but the important relationship between convex hulls and the Voronoi diagram/Delaunay triangulation is usually not discussed. This paper presents Hull2VD, a visualization tool that illustrates...
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1604.01428 شماره
صفحات -
تاریخ انتشار 2016